Max-Plus Convex Geometry
نویسندگان
چکیده
Max-plus analogues of linear spaces, convex sets, and polyhedra have appeared in several works. We survey their main geometrical properties, including max-plus versions of the separation theorem, existence of linear and non-linear projectors, max-plus analogues of the Minkowski-Weyl theorem, and the characterization of the analogues of “simplicial” cones in terms of distributive lattices.
منابع مشابه
Hahn-Banach Separation Theorem for Max-Plus Semimodules
We introduce max-plus analogues of basic Euclidian geometry notions: scalar product is replaced by a scalar division, and the associated distance is essentially Hilbert’s projective distance. We introduce an orthogonal projection and prove a Hahn-Banach type theorem: a point can be separated from a semimodule by a hyperplane orthogonal to the direction of projection. We use these results to sep...
متن کاملMultiorder, Kleene Stars and Cyclic Projectors in the Geometry of Max Cones
This paper summarizes results on some topics in the max-plus convex geometry, mainly concerning the role of multiorder, Kleene stars and cyclic projectors, and relates them to some topics in max algebra. The multiorder principle leads to max-plus analogues of some statements in the finite-dimensional convex geometry and is related to the set covering conditions in max algebra. Kleene stars are ...
متن کاملThe Minkowski Theorem for Max-plus Convex Sets
We establish the following max-plus analogue of Minkowski’s theorem. Any point of a compact max-plus convex subset of (R∪{−∞})n can be written as the max-plus convex combination of at most n + 1 of the extreme points of this subset. We establish related results for closed max-plus convex cones and closed unbounded max-plus convex sets. In particular, we show that a closed max-plus convex set ca...
متن کاملOn model predictive control for max-min-plus-scaling discrete event systems
We extend the model predictive control framework, which is very popular in the process industry due to its ability to handle constraints on inputs and outputs, to a class of discrete event systems that can be modeled using the operations maximization, minimization, addition and scalar multiplication, and that we call max-min-plus-scaling systems. We show that this class encompasses several othe...
متن کاملMax-plus Convex Sets and Functions
We consider convex sets and functions over idempotent semifields, like the max-plus semifield. We show that if K is a conditionally complete idempotent semifield, with completion K̄, a convex function Kn → K̄ which is lower semi-continuous in the order topology is the upper hull of supporting functions defined as residuated differences of affine functions. This result is proved using a separation...
متن کامل